Method and apparatus for filtering noisy estimates to reduce estimation errors

ABSTRACT

Techniques for filtering noisy estimates to reduce estimation errors are described. A sequence of input values (e.g., for an initial channel impulse response estimate (CIRE)) is filtered with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values (e.g., for a filtered CIRE). The coefficient(s) are updated based on the sequence of input values with an adaptive filter, a bank of prediction filters, or a normalized variation technique. To update the coefficient(s) with the adaptive filter, a sequence of predicted values is derived based on the sequence of input values. Prediction errors between the sequence of predicted values and the sequence of input values are determined and filtered to obtain filtered prediction errors. The coefficient(s) of the IIR filter are then updated based on the prediction errors and the filtered prediction errors.

The present application for patent is a Divisional application of application Ser. No. 11/489,087, entitled Method and Apparatus for Filtering Noisy Estimates to Reduce Estimation Errors, filed Jul. 18, 2006 which claims priority to provisional U.S. application Ser. No. 60/737,256, entitled “Prediction Based Optimal Adaptation of Pilot Filter Coefficients for Improved Channel Estimation,” filed Nov. 15, 2005, assigned to the assignee hereof and incorporated herein by reference.

BACKGROUND

I. Field

The present disclosure relates generally to communication, and more specifically to filtering techniques.

II. Background

In a wireless communication system, a transmitter typically processes (e.g., encodes and modulates) traffic data to generate data symbols. For a coherent system, the transmitter multiplexes pilot symbols with the data symbols, processes the multiplexed data and pilot symbols to generate a radio frequency (RF) signal, and transmits the RF signal via a wireless channel. The wireless channel distorts the transmitted RF signal with a channel response and further degrades the signal with noise and interference.

A receiver receives the transmitted RF signal and processes the received RF signal to obtain samples. For coherent data detection, the receiver estimates the response of the wireless channel based on the received pilot and derives a channel estimate. The receiver then performs data detection (e.g., equalization) on the samples with the channel estimate to obtain symbol estimates, which are estimates of the data symbols sent by the transmitter. The receiver then processes (e.g., demodulates and decodes) the symbol estimates to obtain decoded data.

The quality of the channel estimate may have a large impact on data detection performance and may affect the quality of the symbol estimates as well as the reliability of the decoded data. There is therefore a need in the art for techniques to derive a high quality channel estimate in a wireless communication system.

SUMMARY

Techniques for filtering noisy estimates to reduce estimation errors and obtain higher quality estimates are described herein. These techniques may be used for various applications, and the noisy estimates may be any scalar, vector, or matrix. One exemplary application of the techniques is for filtering noisy estimates of a channel impulse response (CIR), which is a time-domain response of a communication channel.

In an embodiment, a sequence of input values is filtered with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values. The sequence of input values may be for an initial channel impulse response estimate (CIRE), and the sequence of output values may be for a filtered CIRE. The coefficient(s) of the IIR filter are updated based on the sequence of input values using one of the update techniques described herein. The IIR filter may have a single coefficient that is referred to as alpha.

In an embodiment, the coefficient(s) of the IIR filter are updated based on an adaptive filter. In this embodiment, a sequence of predicted values is derived based on the sequence of input values, and may be equal to a delayed version of the sequence of output values. Prediction errors between the sequence of predicted values and the sequence of input values are determined and filtered (e.g., with the coefficient(s) of the IIR filter) to obtain filtered prediction errors. The coefficient(s) of the IIR filter are then updated based on the prediction errors and the filtered prediction errors.

In another embodiment, the coefficient(s) of the IIR filter are updated based on a bank of prediction filters. In this embodiment, the sequence of input values is filtered with multiple prediction filters to obtain multiple sequences of predicted values. Each prediction filter has a different set of at least one coefficient. The prediction filter with the smallest prediction error among the multiple prediction filters is identified. The set of coefficient(s) for the identified prediction filter is selected for use to filter the sequence of input values.

In yet another embodiment, the coefficient(s) of the IIR filter are updated based on a normalized variation technique. In this embodiment, variation of a sequence of actual samples (e.g., the CIR) is estimated based on the sequence of input values. This may be achieved by estimating the energy of the sequence of input values, estimating the noise in the sequence of input values, and estimating the variation of the sequence of input samples. The variation of the sequence of actual samples may then be estimated based on the estimated energy, estimated noise, and estimated variation of the sequence of input values. The coefficient(s) of the IIR filter are determined based on the estimated variation of the sequence of actual samples, e.g., using a look-up table or by direct calculation.

Various aspects and embodiments of the invention are described in further detail below.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and nature of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout.

FIG. 1 shows a transmission in a wireless communication system.

FIG. 2 shows a block diagram of a base station and a wireless device.

FIG. 3 shows a block diagram of an equalizer at the wireless device.

FIG. 4 shows a block diagram of a channel IIR filter.

FIG. 5 shows plots of throughput versus alpha for three speed scenarios.

FIGS. 6, 7 and 8 show units that update alpha based on an adaptive filter, a bank of prediction filters, and the normalized variation technique, respectively.

FIG. 9 shows a process for filtering noisy estimates.

FIGS. 10, 11 and 12 show processes for updating alpha based on an adaptive filter, a bank of prediction filters, and the normalized variation technique, respectively.

DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs.

FIG. 1 shows an exemplary transmission in a wireless communication system. For simplicity, FIG. 1 shows only one base station 110 and one wireless device 120. A base station is generally a fixed station that communicates with the wireless devices and may also be called a Node B, an access point, a base transceiver station (BTS), or some other terminology. A wireless device may be fixed or mobile and may also be called a user equipment (UE), a mobile station, a user terminal, a subscriber unit, or some other terminology. A wireless device may be a cellular phone, a personal digital assistant (PDA), a wireless modem card, a handheld device, or some other device or apparatus.

Base station 110 transmits an RF signal to wireless device 120. This RF signal may reach wireless device 120 via one or more signal paths, which may include a direct path and/or reflected paths. The reflected paths are created by reflections of radio waves due to obstructions (e.g., buildings, trees, vehicles, and other structures) in the wireless environment. Wireless device 120 may receive multiple instances or copies of the transmitted RF signal. Each received signal instance is obtained via a different signal path and has a particular complex gain and a particular time delay determined by that signal path. The received RF signal at wireless device 120 is a superposition of all of the received signal instances. Wireless device 120 may also receive interfering transmissions from other transmitting stations, which are shown by dashed lines in FIG. 1.

The filtering techniques described herein may be used for various communication systems such as a Code Division Multiple Access (CDMA) system, a Time Division Multiple Access (TDMA) system, a Frequency Division Multiple Access (FDMA) system, an Orthogonal Frequency Division Multiple Access (OFDMA) system, a Single-Carrier FDMA (SC-FDMA) system, and so on. A CDMA system may implement one or more radio technologies such as Wideband-CDMA (W-CDMA), cdma2000, and so on. cdma2000 covers IS-2000, IS-856 and IS-95 standards. A TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM). These various radio technologies and standards are known in the art. W-CDMA and GSM are described in documents from an organization named “3rd Generation Partnership Project” (3GPP). cdma2000 is described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2). 3GPP and 3GPP2 documents are publicly available. An OFDMA system transmits modulation symbols in the frequency domain on orthogonal subcarriers using OFDM. An SC-FDMA system transmits modulation symbols in the time domain on orthogonal subcarriers.

The filtering techniques described herein may be used for a wireless device as well as a base station. For clarity, these techniques are described below for a wireless device in a CDMA system, which may be a W-CDMA system or a cdma2000 system.

FIG. 2 shows a block diagram of base station 110 and wireless device 120. At base station 110, a transmit (TX) data processor 210 receives traffic data for the wireless devices being served and processes (e.g., encodes, interleaves, and symbol maps) the traffic data to generate data symbols. As used herein, a data symbol is a modulation symbol for data, a pilot symbol is a modulation symbol for pilot, a modulation symbol is a complex value for a point in a signal constellation (e.g., for M-PSK or M-QAM), and pilot is data that is known a priori by both the base station and the wireless device. A CDMA modulator 220 processes the data symbols and pilot symbols and provides output chips to a transmitter (TMTR) 230. Transmitter 230 processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) the output chips and generates an RF signal, which is transmitted from an antenna 232.

At wireless device 120, an antenna 252 receives the transmitted RF signal via direct and/or reflected paths and provides a received RF signal to a receiver (RCVR) 254. Receiver 254 processes (e.g., filters, amplifies, frequency downconverts, and digitizes) the received RF signal to obtain received samples. Receiver 254 may perform pre-processing on the received samples and provide input samples to an equalizer/rake receiver 260. The pre-processing may include, e.g., automatic gain control (AGC), frequency correction, digital filtering, sample rate conversion, and so on. Equalizer/rake receiver 260 processes the input samples (e.g., with an equalizer or a rake receiver) and provides output samples. A CDMA demodulator (Demod) 270 processes the output samples in a manner complementary to the processing by CDMA modulator 220 and provides symbol estimates, which are estimates of the data symbols sent by base station 110 to wireless device 120. The rake receiver and CDMA demodulator may also be combined. A receive (RX) data processor 280 processes (e.g., symbol demaps, deinterleaves, and decodes) the symbol estimates and provides decoded data. In general, the processing by CDMA demodulator 270 and RX data processor 280 is complementary to the processing by CDMA modulator 220 and TX data processor 210, respectively, at base station 110.

Controllers/processors 240 and 290 direct operation of various processing units at base station 110 and wireless device 120, respectively. Memories 242 and 292 store data and program codes for base station 110 and wireless device 120, respectively.

At wireless device 120, the input samples from receiver 254 may be expressed as:

$\begin{matrix} \begin{matrix} {{{y(k)} = {{{h(k)} \otimes \left\lbrack {{x(k)} + {p(k)}} \right\rbrack} + {w(k)}}},} \\ {{= {{\sum\limits_{i = {- \infty}}^{\infty}{{h(i)} \cdot \left\lbrack {{x\left( {k - i} \right)} + {p\left( {k - i} \right)}} \right\rbrack}} + {w(k)}}},} \end{matrix} & {{Eq}\mspace{14mu} (1)} \end{matrix}$

where x(k) is a signal component of interest for wireless device 120,

-   -   p(k) is the pilot from base station 110,     -   h(k) is a time-domain impulse response of the wireless channel         between base station 110 and wireless device 120,     -   w(k) is the total noise and interference observed by x(k) and         p(k),     -   y(k) is the input samples at wireless device 120, and     -   denotes a convolution.

In equation (1), x(k) may be the signal component for a physical channel of interest to wireless device 120. w(k) may include signal components for other physical channels from base station 110, noise from various sources, and interference from other transmitting stations. For simplicity, w(k) is assumed to be additive white Gaussian noise (AWGN) with zero mean and a variance of σ². The input samples y(k) may be processed with an equalizer to obtain an estimate of the desired signal x(k).

FIG. 3 shows a block diagram of an equalizer 260 a, which is an embodiment of equalizer/rake receiver 260 in FIG. 2. In this embodiment, the input samples y(k) from receiver 254 are provided to a channel estimator 310 and a data finite impulse response (FIR) filter 360. Channel estimator 310 derives a channel impulse response estimate (CIRE) ĥ_(n)(l) for the wireless channel between base station 110 and wireless device 120. A computation unit 350 receives the CIRE ĥ_(n)(l) and derives equalizer coefficients based on this CIRE and using, e.g., linear minimum mean square error (LMMSE), least mean square (LMS), recursive least square (RLS), direct matrix inversion (DMI), zero-forcing, or some other technique. FIR filter 360 filters the input samples y(k) with the equalizer coefficients and provides output samples {circumflex over (x)}(k), which are estimates of the desired signal x(k).

The time-domain channel impulse response (CIR) between base station 110 and wireless device 120 may be considered as having L channel taps h(1) through h(L), where L may be any value, e.g., L=64. Each channel tap h(l), for l=1, . . . , L, has a particular complex gain and a particular time delay, both of which are determined by the wireless environment. The CIR may be given in vector form as follows:

h _(n) =[h _(n)(1)h _(n)(2) . . . h _(n)(L)]^(T),  Eq (2)

where h _(n) is an L×1 vector for the CIR in time interval n, and

“T” denotes a transpose.

Wireless device 120 attempts to derive accurate estimates of the L channel taps in the CIR. Within channel estimator 310, an initial channel estimator 320 derives an initial CIRE based on the pilot received from base station 110. In an embodiment, the initial CIRE may be derived as:

$\begin{matrix} {{{{\overset{\sim}{h}}_{n}(l)} = {\frac{1}{K} \cdot {\sum\limits_{i = 0}^{K - 1}{{y\left( {{n \cdot K} + l - 1 + i} \right)} \cdot {p^{*}(i)}}}}},{{{for}\mspace{14mu} l} = 1},\ldots \mspace{14mu},L,} & {{Eq}\mspace{14mu} (3)} \end{matrix}$

where {tilde over (h)}_(n)(l) is an initial estimate of channel tap h(l) in time interval n,

-   -   K is the accumulation length, and     -   “*” denotes a complex conjugate.         The “l−1” in equation (3) is due to index l starting at 1         instead of 0.

In equation (3), channel tap h(l) is estimated by despreading the input samples y(k) in the time domain with the pilot sequence p(k) at a time offset of l−1. L different channel taps may be estimated with L different time offsets. The despreading for each time offset may be achieved by multiplying the input samples y(k) for that time offset with the complex conjugated pilot chips p*(k) and accumulating the results over K chips. K is an integer multiple of the length of an orthogonal code used for the pilot. The pilot orthogonal code is 256 chips long in W-CDMA and 128 chips long in cdma2000. K may be equal to one pilot symbol, multiple pilot symbols, one slot, multiple slots, one frame, or some other duration. A slot covers 2560 chips and 10 pilot symbols in W-CDMA and covers 768 chips and 6 pilot symbols in cdma2000.

An initial CIRE may be derived for each time interval n. A time interval may be a slot, a frame, or some other time duration. The initial CIRE is composed of L channel tap estimates and may be given as {tilde over (h)} _(n)=[{tilde over (h)}_(n)(1) {tilde over (h)}_(n)(2) . . . {tilde over (h)}_(n)(L)]^(T). The initial CIRE contains estimation errors and noise and may be filtered across multiple time intervals to reduce the estimation errors and noise.

In an embodiment that is shown in FIG. 3, a channel IIR filter 330 filters the initial CIRE, as follows:

{tilde over (h)} _(n)=α_(n) ·{tilde over (h)} _(n)+(1−α_(n))· ĥ _(n−1)  Eq (4)

-   where ĥ _(n)=[ĥ_(n)(1) ĥ_(n)(2) . . . ĥ_(n)(L)]^(T) is an L×1 vector     for the filtered CIRE in time interval n, and

α_(n) is a coefficient for time interval n.

The IIR filtering in equation (4) is performed separately for each of the L channel taps. A coefficient computation unit 340 derives the coefficient α_(n) for IIR filter 330.

FIG. 4 shows a block diagram of an embodiment of channel IIR filter 330 in FIG. 3. In this embodiment, channel IIR filter 330 includes L 1-tap IIR filters 410 a through 410 l for the L channel taps. Each IIR filter 410 performs filtering for one tap index. Within the 1-tap IIR filter for tap index l, where lε{1, . . . , L}, a multiplier 412 receives and multiplies an initial channel tap estimate {tilde over (h)}_(n) (l) with coefficient α_(n). A summer 414 subtracts coefficient α_(n) from 1.0 and provides (1−α_(n)). A multiplier 416 multiplies a delayed channel tap estimate ĥ_(n−1)(l) from a register 420 with (1−α_(n)). A summer 418 sums the outputs of multipliers 412 and 416 and provides a filtered channel tap estimate ĥ_(n)(l). Register 420 stores filtered channel tap estimate ĥ_(n)(l) for use in the next time interval.

The filtering in equation (4) reduces noise and improves estimation accuracy. Hence, the filtered CIRE ĥ_(n) is generally an improved estimate of the CIR h _(n). Coefficient α_(n) determines the amount of filtering. In general, 1>α_(n)>0, with a larger α_(n) corresponding to less filtering, and vice versa. In the following description, coefficient α_(n) is referred to as alpha.

It can be shown that improved performance may be achieved with different amounts of filtering for the initial CIRE in different operating scenarios. A good value for alpha may be dependent on speed, received signal quality, and possibly other factors.

FIG. 5 shows plots of throughput versus alpha for three different speed scenarios. A plot 510 shows throughput versus alpha for a high-speed scenario of 120 Km/hr, a plot 512 shows throughput versus alpha for a moderate-speed scenario of 30 Km/hr, and a plot 514 shows throughput versus alpha for a low-speed scenario of 3 Km/hr. These plots indicate that the highest throughput may be achieved with alpha between 0.8 to 1.0 for the high-speed scenario, between 0.5 to 0.7 for the moderate-speed scenario, and between 0.2 and 0.3 for the low-speed scenario.

FIG. 5 indicates that a good choice of alpha depends on mobility. A smaller alpha (more filtering) is better for a slowly varying channel whereas a larger alpha (less filtering) is better for a fast changing channel. It can be shown that a good choice of alpha also depends on received signal quality. For a given speed, a smaller alpha (more filtering) is better for low received signal quality whereas a larger alpha (less filtering) is better for high received signal quality. As suggested by the plots in FIG. 5, performance may degrade significantly if an inappropriate value is used for alpha.

The filtering techniques described herein may reduce estimation errors and provide good performance for various operating scenarios. These techniques include prediction-based techniques and a normalized variation technique. The prediction-based techniques may be implemented with an adaptive filter or a bank of prediction filters.

In an embodiment of the prediction-based techniques, alpha is updated in small steps with an adaptive filter. In an embodiment, the IIR filter in equation (4) is also used as a prediction filter that predicts the channel taps for the next time interval. Hence, in time interval n−1, the filtered CIRE ĥ _(n−1) generated by the IIR filter is used as the predicted CIRE for time interval n

Prediction errors between the initial CIRE and the predicted CIRE may be expressed as:

e _(n) ={tilde over (h)} _(n) −h _(n−1)  Eq (5)

where e _(n)=[e_(n)(1) e_(n)(2) . . . e_(n)(L)]^(T) is an L×1 vector of prediction errors for the L predicted channel taps in time interval n.

Alpha may be adaptively updated in each time interval n as follows:

$\begin{matrix} {{\alpha_{n + 1} = {\alpha_{n} - {\chi \cdot \frac{\partial{{\underset{\_}{e}}_{n}}^{2}}{\partial\alpha}}}},} & {{Eq}\mspace{14mu} (6)} \end{matrix}$

where ∥e _(n)∥² is the norm square of the prediction error vector, and

χ is a coefficient that determines the rate of adaptation for alpha.

Equation (6) updates alpha to minimize the norm square of the prediction errors to achieve minimum mean square error (MMSE). The partial derivative term ∂∥e _(n)∥²/∂α is indicative of an error gradient. Alpha is updated based on, and in the opposite direction of, the gradient of the norm square prediction error. The speed of adaptation is determined by coefficient χ, which may be selected to provide good performance. Coefficient χ may be set to 0.01 or some other value.

The partial derivative term in equation (6) may be expressed as:

$\begin{matrix} \begin{matrix} {\frac{\partial{{\underset{\_}{e}}_{n}}^{2}}{\partial\alpha} = {{- 2}{Re}\left\{ {{\underset{\_}{e}}_{n}^{H} \cdot \frac{\partial{\hat{\underset{\_}{h}}}_{n - 1}}{\partial\alpha}} \right\}}} \\ {{= {{- 2}{Re}\left\{ {{\underset{\_}{e}}_{n}^{H} \cdot {\underset{\_}{f}}_{n}} \right\}}},} \end{matrix} & {{Eq}\mspace{14mu} (7)} \end{matrix}$

where “H” denotes a conjugate transpose.

The term ∂ĥ _(n−1)/∂α in equation (7) may be expressed as:

$\begin{matrix} {{\frac{\partial{\hat{\underset{\_}{h}}}_{n - 1}}{\partial\alpha} = {{\underset{\_}{f}}_{n} = {{\underset{\_}{e}}_{n - 1} + {\left( {1 - \alpha_{n}} \right) \cdot {\underset{\_}{f}}_{n - 1}}}}},} & {{Eq}\mspace{14mu} (8)} \end{matrix}$

where f _(n)=[f_(n)(1) f_(n)(2) . . . f_(n)(L)]^(T) is an L×1 vector of filtered prediction errors for the L channel taps in time interval n.

Equation (7) indicates that the term ∂ĥ _(n−1)/∂α may be derived based on the prediction errors e _(n) computed in the current time interval n and the filtered prediction errors f _(n) for the current time interval n.

The partial derivative term in equation (6) may then be expressed as:

$\begin{matrix} {\frac{\partial{{\underset{\_}{e}}_{n}}^{2}}{\partial\alpha} = {{- 2} \cdot {\sum\limits_{l = 1}^{L}{{Re}{\left\{ {{e_{n}^{*}(l)} \cdot {f_{n}(l)}} \right\}.}}}}} & {{Eq}\mspace{14mu} (9)} \end{matrix}$

Alpha may then be updated as:

$\begin{matrix} {\alpha_{n + 1} = {\alpha_{n} + {2{\chi \cdot {\sum\limits_{l = 1}^{L}{{Re}{\left\{ {{e_{n}^{*}(l)} \cdot {f_{n}(l)}} \right\}.}}}}}}} & {{Eq}\mspace{14mu} (10)} \end{matrix}$

In the embodiment shown in equations (6) through (10), a single alpha is used for all L channel taps, and this alpha is updated based on all L channel taps. In another embodiment, a separate alpha is used for each channel tap and may be updated based on the prediction error for that channel tap, as follows:

${{\alpha_{n + 1}(l)} = {{\alpha_{n}(l)} - {\chi \cdot \frac{\partial{{e_{n}(l)}}^{2}}{\partial\alpha}}}},\begin{matrix} {\frac{\partial{{e_{n}(l)}}^{2}}{\partial\alpha} = {{- 2}{Re}\left\{ {{e_{n}^{*}(l)} \cdot \frac{\partial{{\hat{h}}_{n - 1}(l)}}{\partial\alpha}} \right\}}} \\ {{= {{- 2}{Re}\left\{ {{e_{n}^{*}(l)} \cdot {f_{n}(l)}} \right\}}},{and}} \end{matrix}$ $\frac{\partial{{\hat{h}}_{n - 1}(l)}}{\partial\alpha} = {{f_{n}(l)} = {{e_{n - 1}(l)} + {\left( {1 - {\alpha_{n}(l)}} \right) \cdot {{f_{n - 1}(l)}.}}}}$

Alpha may be updated based on an adaptive filter as follows. Initially, the filtered CIRE ĥ _(n−1) and the filtered prediction errors f _(n) are initialized to zero. Alpha may be initialized to a value that provides good performance for most operating scenarios, e.g., α_(n)=0.6. Thereafter, alpha may be updated in each time interval n as follows:

-   -   1. Obtain an initial CIRE {tilde over (h)} _(n), e.g., as shown         in equation (3),     -   2. Compute the prediction errors e _(n) as shown in equation         (5),     -   3. Compute the partial derivative term ∂∥e _(n)∥²/∂α based on         the prediction errors e _(n) and the filtered prediction errors         f _(n), as shown in equation (9),     -   4. Update alpha based on the partial derivative term and the         step size χ, as shown in equation (10), and     -   5. Update the filtered prediction errors based on the prediction         errors e _(n) and the updated alpha α_(n+1), as shown in         equation (8).         The updated alpha α_(n+1) may be used to filter the initial CIRE         in the next time interval.

FIG. 6 shows an embodiment of a coefficient computation unit 340 a that updates alpha with an adaptive filter. Channel IIR filter 330 filters the initial CIRE {tilde over (h)} _(n) with the current alpha α_(n) and provides the filtered CIRE ĥ _(n). Within unit 340 a, a prediction error computation unit 610 receives the initial CIRE {tilde over (h)} _(n) and the predicted CIRE ĥ _(n−1) from a register 616. Unit 610 computes the prediction errors e _(n) as shown in equation (5). An alpha update unit 614 receives the prediction errors e _(n) and the filtered prediction errors f _(n), updates the alpha as shown in equations (9) and (10), and provides the updated alpha α_(n+1) for the next time interval. A filter 612 filters the prediction errors e _(n) as shown in equation (8) and provides the filtered prediction errors for the next time interval. Register 616 receives and stores the filtered CIRE ĥ _(n), which is used as the predicted CIRE for the next time interval.

The use of an adaptive filter to update alpha may provide various advantages. First, the filtered CIRE, the filtered prediction errors, and alpha may be derived with relatively small amounts of computation and memory. Second, fast convergence rate may be achieved since the filtered prediction errors are obtained based on a variable IIR filter, as shown in equation (8). Third, the adaptation speed may be controlled by selecting a suitable value for coefficient χ.

In another embodiment of the prediction-based techniques, alpha is selected from among a bank of prediction filters with different alphas. In this embodiment, the initial CIRE may be filtered with M different prediction filters, as follows:

ĥ _(n) ^((m))=α^((m)) ·{tilde over (h)} _(n)+(1−α^((m)))· ĥ _(n−1) ^((m)), for m=1, . . . M ,  Eq (11)

-   where ĥ _(n) ^((m))=[ĥ_(n) ^((m))(1) ĥ_(n) ^((m))(2) . . . ĥ_(n)     ^((m))(L)]^(T) is an L×1 vector for the predicted CIRE from     prediction filter m in time interval n, and

α^((m)) is the alpha for prediction filter m.

M different alphas may be used for the M prediction filters, where in general M>1. In an embodiment, the M alphas are evenly distributed from 0 to 1, e.g., α^((m))=m/M. For example, M may be equal to 10, and 10 prediction filters may be implemented with 10 equally spaced alphas of 0.1, 0.2, . . . , 1.0. The M alphas may also be set to other values, e.g., more concentrated in certain ranges where the wireless device is expected to operate.

The prediction errors for each prediction filter may be expressed as:

e _(n) ^((m)) ={tilde over (h)} _(n) −ĥ _(n−1) ^((m)), for m=1, . . . M ,  Eq (12)

where e _(n) ^((m))=[e_(n) ^((m))(1) e_(n) ^((m))(2) . . . e_(n) ^((m))(L)]^(T) is an L×1 vector of prediction errors for prediction filter m in time interval n.

In each time interval n, one of the M alphas may be selected for use, as follows:

$\begin{matrix} {{m_{n} = {\min\limits_{{m = 1},\ldots \mspace{14mu},M}{\left\{ {{\underset{\_}{e}}_{n}^{(m)}}^{2} \right\}}}},} & {{Eq}\mspace{14mu} (13)} \\ {{\alpha_{n + 1} = \alpha^{(m_{n})}},} & {{Eq}\mspace{14mu} (14)} \end{matrix}$

where

{ } denotes an expectation operation,

-   -   {∥e _(n) ^((m))∥²} is a prediction mean square error (MSE) for         prediction filter m, and m_(n) is the index of the prediction         filter with the minimum prediction MSE.

In equation (13), the prediction filter that gives the minimum prediction MSE for all L channel taps is selected. In equation (14), the alpha for the selected prediction filter is provided as the alpha used to filter the initial CIRE.

The prediction MSE may be estimated for each prediction filter m, as follows:

$\begin{matrix} {{{MSE}_{n}^{(m)} = {{\eta \cdot {\sum\limits_{l = 1}^{L}\; {{e_{n}^{(m)}(l)}}^{2}}} + {\left( {1 - \eta} \right) \cdot {MSE}_{n - 1}^{(m)}}}},} & {{Eq}\mspace{14mu} (15)} \end{matrix}$

-   where MSE_(n) ^((m)) is an estimated prediction MSE for prediction     filter m in time interval n, and

η a coefficient that determines the amount of averaging for the prediction MSE.

Coefficient η may be set to 0.05 or some other value.

Alpha may be derived based on a bank of prediction filters as follows. Initially, the predicted CIRE ĥ _(n−1) ^((m)) and the estimated prediction MSE, MSE_(n−1) ^((m)), for each of the M prediction filters are initialized to zero. Thereafter, alpha may be selected in each time interval n as follows:

-   -   1. Obtain an initial CIRE {tilde over (h)} _(n), e.g., as shown         in equation (3),     -   2. Compute the prediction errors e _(n) ^((m)) for each         prediction filter, as shown in equation (12),     -   3. Compute the estimated prediction MSE, MSE_(n) ^((m)), for         each prediction filter based on its prediction errors e _(n)         ^((m)), as shown in equation (15),     -   4. Select the alpha of the prediction filter with the smallest         estimated prediction MSE, as shown in equations (13) and (14),         and     -   5. Update each prediction filter as shown in equation (11).

FIG. 7 shows an embodiment of a coefficient computation unit 340 b that derives alpha based on a bank of prediction filters. Unit 340 b includes M processing sections 710 a through 710 m for M different alphas, a detector 720, and a selector 730.

Within each processing section 710, a prediction filter 712 filters the initial CIRE {tilde over (h)} _(n) with an assigned alpha α^((m)), as shown in equation (11), and provides a filtered CIRE ĥ _(n) ^((m)). A register 714 stores the filtered CIRE ĥ _(n) ^((m)), which is used as the predicted CIRE for the next time interval. A unit 716 receives the initial CIRE {tilde over (h)} _(n) and the predicted CIRE ĥ _(n−1) ^((m)) and computes the prediction errors e _(n) ^((m)), as shown in equation (12). An MSE estimator 718 derives the estimated prediction MSE based on the prediction errors e _(n) ^((m)), as shown in equation (15).

Detector 720 receives the estimated prediction MSEs from all M MSE estimators 718 a through 718 m, identifies the best prediction filter with the smallest estimated prediction MSE, and provides the alpha for the best prediction filter as the alpha α_(n+1) for the next time interval. Selector 730 provides the filtered CIRE from the best prediction filter as the filtered CIRE ĥ _(n).

In one embodiment, a separate channel IIR filter is maintained, and the alpha for this IIR filter is updated based on the alpha of the best prediction filter in each time interval. In another embodiment, the filtered CIRE from the best prediction filter is provided as the filtered CIRE ĥ _(n). In this embodiment, one of the prediction filters acts as the channel IIR filter in each time interval.

The use of a bank of prediction filters to derive alpha may provide several advantages. First, the filter bank settles to the best alpha value quickly. Second, the filter bank is able to adapt to changing channel conditions with a convergence delay that is dependent on the IIR filter used to estimate the prediction MSE in equation (15). However, the filter bank generally uses more computation and memory than the adaptive filter described above.

In an embodiment of the normalized variation technique, alpha is derived based on estimated variation of the wireless channel. The wireless channel may be modeled to have “memory”, which is related to the time constant of the filtering for the initial CIRE. The variation of the wireless channel is inversely related to the memory of the channel. Hence, the variation of the channel or the memory of the channel may be estimated and used to determine a good value for alpha.

The initial CIRE is a noisy estimate of the CIR and may be expressed as:

{tilde over (h)} _(n) =h+w _(n),  Eq (16)

where w _(n) is an L×1 vector of noise and estimation errors in time interval n.

A normalized variation of the wireless channel may be defined as:

$\begin{matrix} {{{NV} = \frac{\left\{ {{{\underset{\_}{h}}_{n} - {\underset{\_}{h}}_{n - 1}}}^{2} \right\}}{\left\{ {{\underset{\_}{h}}_{n}}^{2} \right\}}},} & {{Eq}\mspace{14mu} (17)} \end{matrix}$

-   where     {∥h _(n)−h _(n−1)∥²} is the expected difference in the CIR in time     interval n,     {∥h _(n)∥²} is the expected channel energy in time interval n, and     NV is the normalized variation of the wireless channel.

The normalized variation in equation (17) may be rewritten as:

$\begin{matrix} {{{NV} = \frac{{\left\{ {{{\underset{\_}{\overset{\sim}{h}}}_{n} - {\underset{\_}{\overset{\sim}{h}}}_{n - 1}}}^{2} \right\}} - {2\left\{ {{\underset{\_}{w}}_{n}}^{2} \right\}}}{\left. {{\left\{ {{\underset{\_}{\overset{\sim}{h}}}_{n}}^{2} \right\}} - {\left\{ {{\underset{\_}{w}}_{n}} \right.^{2}}} \right\}}},} & {{Eq}\mspace{14mu} (18)} \end{matrix}$

-   where     {∥ĥ _(n)−ĥ _(n−1)∥²} is the expected difference in the initial CIRE     in time interval n,     {∥ĥ _(n)∥²} is the expected energy of the initial CIRE in time     interval n, and     {∥ŵ _(n)∥²} is the expected noise energy in time interval n.

Each of the three different expectation quantities in equation (18) may be estimated based on the initial CIRE. To estimate

{∥{tilde over (h)} _(n)−{tilde over (h)} _(n−1)∥²}, the quantity ∥{tilde over (h)} _(n)−{tilde over (h)} _(n−1)∥² may first be computed as:

$\begin{matrix} {{{\overset{\sim}{D}}_{n} = {{{{\underset{\_}{\overset{\sim}{h}}}_{n} - {\overset{\sim}{\underset{\_}{h}}}_{n - 1}}}^{2} = {\sum\limits_{l = 1}^{L}{{{{\overset{\sim}{h}}_{n}(l)} - {{\overset{\sim}{h}}_{n - 1}(l)}}}^{2}}}},} & {{Eq}\mspace{14mu} (19)} \end{matrix}$

where {tilde over (D)}_(n) is the norm square of the differences between the initial channel tap estimates for time intervals n and n−1.

The difference norm square {tilde over (D)}_(n) may be filtered as follows:

{circumflex over (D)} _(n) =μ·{tilde over (D)} _(n)+(1−μ)·{circumflex over (D)} _(n−1),  Eq (20)

where {circumflex over (D)}_(n) is an estimate of

{∥{tilde over (h)} _(n)−{tilde over (h)} _(n−1)∥²}, and

μ is a coefficient that determines the amount of averaging for {circumflex over (D)}_(n).

Coefficient μ may be set to 0.5 or some other value.

To estimate

{∥{tilde over (h)} _(n)∥²}, the quantity ∥{tilde over (h)} _(n)∥² may first be computed as:

$\begin{matrix} {{{\overset{\sim}{H}}_{n} = {{{\underset{\_}{\overset{\sim}{h}}}_{n}}^{2} = {\sum\limits_{l = 1}^{L}{{{\overset{\sim}{h}}_{n}(l)}}^{2}}}},} & {{Eq}\mspace{14mu} (21)} \end{matrix}$

where {tilde over (H)}_(n) is the norm square of the initial channel tap estimates for time interval n.

The channel norm square {tilde over (H)}_(n) may be filtered as follows:

Ĥ _(n) =μ·{tilde over (H)} _(n)+(1−μ)·Ĥ _(n−1),  (22)

where Ĥ_(n) is an estimate of

{∥{tilde over (h)} _(n)∥²}.

To estimate

{∥w _(n)∥²}, some channel taps at one or both ends of the initial CIRE may be assumed to contain pure noise and no signal. The noise energy for time interval n, denoted as {tilde over (W)}_(n), may then be estimated as:

$\begin{matrix} {{\overset{\sim}{W}}_{n} = {\frac{1}{A + B} \cdot {\left( {{\sum\limits_{l = 1}^{A}{{{\overset{\sim}{h}}_{n}(l)}}^{2}} + {\sum\limits_{l = {L - B + 1}}^{L}{{{\overset{\sim}{h}}_{n}(l)}}^{2}}} \right).}}} & {{Eq}\mspace{14mu} (23)} \end{matrix}$

Equation (23) assumes that the first A initial channel tap estimates as well as the last B initial channel tap estimates are pure noise. A and B may be selected to achieve good noise estimation performance. In an embodiment, L=64 and A=B=4. Other values may also be used for L, A and B. The noise energy may also be estimated in other manners, e.g., based on initial channel tap estimates with low energy.

The noise energy {tilde over (W)}_(n) may be filtered as follows:

Ŵ _(n) =μ·{tilde over (W)} _(n)+(1−μ)·Ŵ _(n−1),  Eq (24)

where Ŵ_(n) is an estimate of

{∥w _(n)∥²}.

The same coefficient μ a may be used to derive all three quantities {circumflex over (D)}_(n), Ĥ_(n) and Ŵ_(n), as shown in equations (20), (22) and (24), respectively. Alternatively, different coefficients may be used for different quantities.

The wireless channel may be represented with a Gauss-Markov channel model, as follows:

h _(n) =γ·h _(n−1)+√{square root over (1−γ²)}· u _(n),  Eq (25)

where γεc [0, 1] may be viewed as the memory of the wireless channel, and

-   -   u _(n) is an L×1 vector of independent identically distributed         (i.i.d.) Gaussian random variables.

The channel memory γ provides another way of parameterizing Doppler effect in the wireless channel. A larger value of γ means that the wireless channel has a longer memory, which corresponds to more filtering.

Combining equations (17) and (25), the normalized variation may be given as:

NV=2(1−γ).  Eq (26)

The channel memory may then be expressed as:

$\begin{matrix} {\gamma = {1 - {\frac{NV}{2}.}}} & {{Eq}\mspace{14mu} (27)} \end{matrix}$

The three expectation quantities of the normalized variation in equation (18) may be estimated as described above. The channel memory may then be estimated as follows:

$\begin{matrix} {{{\hat{\gamma}}_{n} = {1 - {\frac{1}{2}\left( \frac{{\hat{D}}_{n} - {2{\hat{W}}_{n}}}{{\hat{H}}_{n} - {\hat{W}}_{n}} \right)}}},} & {{Eq}\mspace{14mu} (28)} \end{matrix}$

where {circumflex over (γ)}_(n) is the estimated channel memory in time interval n.

In an embodiment, alpha is determined for different values of channel memory γ or normalized variation NV (e.g., based on computer simulation, calculation, and/or empirical measurements) and stored in a look-up table. Thereafter, the channel memory or normalized variation may be estimated as described above and provided to the look-up table. The look-up table would then return the alpha value to use to filter the initial CIRE.

In another embodiment, alpha is computed directly. A filter may be defined as follows:

ĥ _(n) =a·ĥ _(n) +b·ĥ _(n−1)  Eq (29)

where a and b are two coefficients. Given

{∥{tilde over (h)} _(n)∥²},

{∥w _(n)∥²} and γ, the values of a and b may be determined such that the expected estimation error ξ=

{∥ĥ−h∥²} is minimized

The solution to the above criterion may be derived as follows. Variables r and ρ may be defined as:

$\begin{matrix} {{r = {1 - \frac{\left\{ {{\underset{\_}{w}}_{n}}^{2} \right\}}{\left\{ {{\underset{\_}{h}}_{n}}^{2} \right\}}}},{and}} & {{Eq}\mspace{14mu} (30)} \\ {\rho = {\frac{2 - {r \cdot \left( {1 + \gamma^{2}} \right)}}{\gamma \cdot \left( {r - 1} \right)}.}} & {{Eq}\mspace{14mu} (31)} \end{matrix}$

The values of a and b that satisfy the above criterion may then be given as:

$\begin{matrix} {{b^{*} = \frac{{- \rho} - \sqrt{\rho^{2} - 4}}{2}},{and}} & {{Eq}\mspace{14mu} (32)} \\ {a^{*} = {\frac{1 - b^{2}}{2 - {r \cdot \left( {1 - {b \cdot \gamma}} \right)}}.}} & {{Eq}\mspace{14mu} (33)} \end{matrix}$

Alpha may then be expressed as:

$\begin{matrix} {\alpha_{n + 1} = {\frac{a}{a + b}.}} & {{Eq}\mspace{14mu} (34)} \end{matrix}$

Alpha may be derived based on the normalized variation technique as follows. Initially, the quantities {circumflex over (D)}_(n−1), Ĥ_(n−1) and Ŵ_(n−1) are initialized to zero. Thereafter, alpha may be derived in each time interval n as follows:

-   -   1. Obtain an initial CIRE {tilde over (h)} _(n), e.g., as shown         in equation (3),     -   2. Compute {circumflex over (D)}_(n), Ĥ_(n) and Ŵ_(n) based on         the initial CIRE, as shown in equations (19) through (24),     -   3. Compute an estimate of the channel memory, {circumflex over         (γ)}_(n), as shown in equation (28),

${{\hat{r}}_{n} = {1 - \frac{{\hat{W}}_{n}}{{\hat{H}}_{n} - {\hat{W}}_{n}}}},$

-   -   4. Compute an estimate of r as     -   5. Compute an estimate of ρ as shown in equation (31),     -   6. Compute estimates of a and b as shown in equations (32) and         (33), and     -   7. Compute alpha as shown in equation (34).         The computed alpha α_(n+1) may be used to filter the initial         CIRE in the next time interval.

FIG. 8 shows an embodiment of a coefficient computation unit 340 c that derives alpha based on the normalized variation technique. Within unit 340 c, the initial CIRE {tilde over (h)} _(n) is provided to units 810, 812 and 814 and a register 816. Register 816 stores {tilde over (h)} _(n) and provides {tilde over (h)} _(n−1). Unit 810 derives an estimate of

{{tilde over (h)} _(n)∥²} as shown in equations (21) and (22), and provides this estimate as Ĥ_(n). Unit 812 derives an estimate of

{∥w _(n)∥²}, as shown in equations (23) and (24), and provides this estimate as Ŵ_(n). Unit 814 also receives {tilde over (h)} from register 816 and derives an estimate of

{∥{tilde over (h)} _(n)−{tilde over (h)} _(n−1)∥²} as shown in equations (19) and (20), and provides this estimate as {circumflex over (D)}_(n).

In an embodiment, a channel memory estimator 820 estimates the channel memory based on Ĥ_(n), Ŵ_(n), and {circumflex over (D)}_(n), as shown in equation (28), and provides the estimated channel memory {circumflex over (γ)}_(n). A look-up table 822 receives the estimated channel memory and provides the alpha α_(n+1) for the next time interval. In another embodiment, a computation unit 830 receives Ĥ_(n), Ŵ_(n), and {circumflex over (γ)}_(n) and computes the alpha α_(n+1), as shown in equations (30) through (34).

For clarity, the filtering techniques have been specifically described for filtering an initial CIRE to reduce estimation errors. In general, these techniques may be used to filter any type of scalar, vector, and matrix. For example, a sequence of vectors v _(i) may be obtained for different values of parameter i. Parameter i may be for time, frequency, and so on. The sequence of vectors v _(i) may be filtered based on any of the techniques described above to reduce estimation errors and obtain an output sequence of vectors having improved characteristics.

FIG. 9 shows an embodiment of a process 900 for filtering noisy estimates. A sequence of input values is filtered with an IIR filter having at least one coefficient to obtain a sequence of output values (block 910). In an embodiment, the sequence of input values is for an initial CIRE, and the sequence of output values is for a filtered CIRE. In another embodiment, the sequence of input values is for an initial frequency-domain channel frequency response estimate, and the sequence of output values is for a filtered channel frequency response estimate. The input and output values may also be for other quantities. The at least one coefficient of the IIR filter is updated based on the sequence of input values, e.g., using any of the techniques described herein (block 920).

FIG. 10 shows an embodiment of a process 920 a for updating the at least one coefficient of the IIR filter with an adaptive filter. Process 920 a may be used for block 920 in FIG. 9. A sequence of predicted values is derived based on the sequence of input values (block 1012). The sequence of predicted values may be equal to the sequence of output values, appropriately delayed. Prediction errors between the sequence of predicted values and the sequence of input values are determined (block 1014). The prediction errors are filtered (e.g., with the coefficient(s) of the IIR filter) to obtain filtered prediction errors (block 1016). The coefficient(s) of the IIR filter are updated based on the prediction errors and the filtered prediction errors (block 1018). An error gradient of the prediction errors may also be determined in other manners, and the coefficient(s) of the IIR filter may be updated based on the error gradient.

FIG. 11 shows an embodiment of a process 920 b for deriving the at least one coefficient of the IIR filter with a bank of prediction filters. Process 920 b may also be used for block 920 in FIG. 9. The sequence of input values is filtered with multiple prediction filters to obtain multiple sequences of predicted values (block 1112). Each prediction filter has a different set of at least one coefficient. The prediction filter with the smallest prediction error among the multiple prediction filters is identified. This may be achieved by computing errors between the sequence of input values and the sequence of predicted values for each prediction filter (block 1114), determining the mean square error for each prediction filter based on the errors for the prediction filter (block 1116), and identifying the prediction filter with the smallest mean square error (block 1118). The set of at least one coefficient for the identified prediction filter is selected for use to filter the sequence of input values (block 1120).

FIG. 12 shows an embodiment of a process 920 c for updating the at least one coefficient of the IIR filter based on the normalized variation technique. Process 920 c may also be used for block 920 in FIG. 9. The sequence of input samples is a noisy estimate of a sequence of actual values. Variation of the sequence of actual samples is estimated based on the sequence of input values. This may be achieved by estimating the energy of the sequence of input values (block 1212), estimating the noise in the sequence of input values (block 1214), and estimating the variation of the sequence of input samples (block 1216). The variation of the sequence of actual samples may then be estimated based on the estimated energy, estimated noise, and estimated variation of the sequence of input values (block 1218). The at least one coefficient of the IIR filter is then determined based on the estimated variation of the sequence of actual samples, e.g., using a look-up table or by direct calculation (block 1220).

The filtering techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, firmware, software, or a combination thereof. For a hardware implementation, the processing units used to perform filtering and updating may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, electronic devices, other electronic units designed to perform the functions described herein, or a combination thereof.

For a firmware and/or software implementation, the techniques may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The firmware and/or software codes may be stored in a memory (e.g., memory 292 in FIG. 2) and executed by a processor (e.g., processor 290). The memory may be implemented within the processor or external to the processor.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. 

1. An apparatus comprising: at least one processor configured to filter a sequence of input values with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values, and to derive a sequence of predicted values based on the sequence of input values, to determine prediction errors between a sequence of predicted values and the sequence of input values, to filter the determined prediction errors, to calculate a partial derivative term based on the determined prediction errors and filtered determined prediction errors, and to update the at least one coefficient based on the partial derivative term; and a memory coupled to the at least one processor, wherein the at least one processor is configured to filter the sequence of input values with multiple prediction filters to obtain multiple sequences of predicted values, each prediction filter having a different set of at least one coefficient, to identify a prediction filter with a smallest prediction error among the multiple prediction filters, and to filter the sequence of input values using the set of at least one coefficient for the identified prediction filter.
 2. The apparatus of claim 1, wherein the at least one processor is configured to compute errors between the sequence of input values and the sequence of predicted values for each prediction filter, to determine a mean square error for each prediction filter based on the errors for the prediction filter, and to identify the prediction filter with a smallest mean square error.
 3. The apparatus of claim 1, wherein each prediction filter has a single coefficient, and wherein the multiple prediction filters have different coefficients.
 4. The apparatus of claim 1, wherein the at least one processor is further configured to select and output the sequence of predicted values from the identified prediction filter as a filtered channel impulse response estimate.
 5. The apparatus of claim 1, wherein the processor is configured to filter the determined prediction errors using a coefficient of the IIR.
 6. A method comprising: filtering a sequence of input values with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values; deriving a sequence of predicted values based on the sequence of input values; determining prediction errors between the sequence of predicted values and the sequence of input values; filtering the determined prediction errors; calculating a partial derivative term based on the determined prediction errors and filtered determined prediction errors; and updating the at least one coefficient based on the partial derivative term, wherein the updating the at least one coefficient comprises: filtering the sequence of input values with multiple prediction filters to obtain multiple sequences of predicted values, each prediction filter having a different set of at least one coefficient, identifying a prediction filter with a smallest prediction error among the multiple prediction filters, and selecting the set of at least one coefficient for the identified prediction filter as the at least one coefficient.
 7. The method of claim 6, wherein the identifying the prediction filter with the smallest prediction error comprises: computing errors between the sequence of input values and the sequence of predicted values for each prediction filter, determining a mean square error for each prediction filter based on the errors for the prediction filter, and identifying the prediction filter with a smallest mean square error.
 8. The method of claim 6, wherein each prediction filter has a single coefficient.
 9. The method of claim 6, further comprising selecting and outputting the sequence of predicted values from the identified prediction filter as a filtered channel impulse response estimate.
 10. The method of claim 6, wherein filtering the determined prediction errors comprises using a coefficient of the IIR.
 11. An apparatus comprising: means for filtering a sequence of input values with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values; means for deriving a sequence of predicted values based on the sequence of input values; means for determining prediction errors between the sequence of predicted values and the sequence of input values; means for filtering the determined prediction errors; means for calculating a partial derivative term based on the determined prediction errors and filtered determined prediction errors; and means for updating the at least one coefficient based on the partial derivative term, wherein the means for updating the at least one coefficient comprises: means for filtering the sequence of input values with multiple prediction filters to obtain multiple sequences of predicted values, each prediction filter having a different set of at least one coefficient, means for identifying a prediction filter with a smallest prediction error among the multiple prediction filters, and means for selecting the set of at least one coefficient for the identified prediction filter as the at least one coefficient.
 12. The apparatus of claim 11, wherein the means for identifying the prediction filter with the smallest prediction error comprises: means for computing errors between the sequence of input values and the sequence of predicted values for each prediction filter, means for determining a mean square error for each prediction filter based on the errors for the prediction filter, and means for identifying the prediction filter with a smallest mean square error.
 13. The apparatus of claim 11, wherein each prediction filter has a single coefficient.
 14. The apparatus of claim 11, further comprising means for selecting and outputting the sequence of predicted values from the identified prediction filter as a filtered channel impulse response estimate.
 15. The apparatus of claim 11, wherein the means for filtering the determined prediction errors are configured to use a coefficient of the IIR to filter the determined prediction errors.
 16. A computer program product residing on a processor-readable medium and comprising processor-readable instructions configured to cause a processor to: filter a sequence of input values with an infinite impulse response (IIR) filter having at least one coefficient to obtain a sequence of output values; derive a sequence of predicted values based on the sequence of input values; determine prediction errors between the sequence of predicted values and the sequence of input values; filter the determined prediction errors; calculate a partial derivative term based on the determined prediction errors and filtered determined prediction errors; and update the at least one coefficient based on the partial derivative term, wherein the updating the at least one coefficient comprises: filter the sequence of input values with multiple prediction filters to obtain multiple sequences of predicted values, each prediction filter having a different set of at least one coefficient, identify a prediction filter with a smallest prediction error among the multiple prediction filters, and select the set of at least one coefficient for the identified prediction filter as the at least one coefficient.
 17. The computer program product of claim 16, wherein the instructions configured to cause the processor to identify the prediction filter with the smallest prediction error are configured to cause the processor to: compute errors between the sequence of input values and the sequence of predicted values for each prediction filter, determine a mean square error for each prediction filter based on the errors for the prediction filter, and identify the prediction filter with a smallest mean square error.
 18. The computer program product of claim 16, further comprising instructions configured to cause the processor to select and output the sequence of predicted values from the identified prediction filter as a filtered channel impulse response estimate.
 19. An apparatus comprising: a memory; and a processor coupled to the memory and configured to: filter a sequence of input values with an infinite impulse response (IIR) filter using a first coefficient to obtain a sequence of output values; derive multiple sequences of predicted values based on the sequence of input values by filtering the sequence of input values with multiple prediction filters each using a different second coefficient; determine prediction errors between the sequences of predicted values and the sequence of input values; filter the determined prediction errors; calculate a partial derivative term based on the determined prediction errors and the filtered determined prediction errors; and update the first coefficient based on the partial derivative term.
 20. The apparatus of claim 19 wherein the processor is further configured to: identify which of the multiple sequences of predicted values has a smallest prediction error; and filter the sequence of input values using the second coefficient corresponding to the sequence of predicted values with the smallest prediction error. 